Puzzles at Large N
نویسندگان
چکیده
We consider the AdS/CFT correspondence and find that essentially all " single particle " primary fields with higher spin, predicted from the CFT side are missing from the Kaluza-Klein excitations of the AdS supergravity. Some 2 and 4 dimensional CFT's are used to illustrate the puzzle. In the 2 dimensional case, the high mass extension of these missing states gives rise to the macroscopic entropy of extremal 5d black holes.
منابع مشابه
A Sudoku-Solver for Large Puzzles using SAT
n × n Sudoku puzzles can be straightforwardly encoded as SAT problems. However, solving such puzzles for large n requires a significant amount of optimization. We present some ideas for reducing the number of clauses, for improving the encoding, and for the selection of suitable SAT solvers.
متن کاملThe impact of using problem-solving puzzles on Iranian intermediate EFL learners' lexical knowledge
This study tried to investigate the impact of using problem-solving puzzles onIranian Intermediate EFL learners' lexical knowledge. At first a homogenoussample of 30 Intermediate EFL learners attending in the third grade of Shahedhigh school in Lahijan were selected and they were randomly divided into twogroups, as experimental group and control group. In the first session, the pretestwas admin...
متن کاملAutomated generation and visualization of picture-logic puzzles
A picture-logic puzzle is a game that takes the form of an N M grid, with numbers situated on the left of its rows and on the top of its columns, which give the clues for solving the puzzle. These puzzles have gained popularity in the last years all over the world, and there are companies involved in the commercialization of products related to them, mainly magazines, on-line puzzles via the we...
متن کاملEven $1 \times n$ Edge-Matching and Jigsaw Puzzles are Really Hard
We prove the computational intractability of rotating and placing n square tiles into a 1×n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the...
متن کاملEdge-Matching and Jigsaw Puzzles are Really Hard
We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NPhard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying th...
متن کاملNo Easy Puzzles: A Hardness Result for Jigsaw Puzzles
We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998